Linear Stationary Point Problems on Unbounded Polyhedra
نویسندگان
چکیده
منابع مشابه
On Robust Positive Invariance of Unbounded Polyhedra
This study analyzes continuous-time linear systems with uncertain parameters on their state and control matrices (A and B), and subject to linear symmetrical constraints on their state (or output) vector. The presented work investigates the possibility to construct a state-feedback law that makes the constrained domain positively invariant with respect to the uncertain closed-loop system. In pa...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملVertex-Facet Incidences of Unbounded Polyhedra
How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is bounded. In the case of a polyhedron that is simple and “simplicial,” i.e., a d-dimensional polyhedron that has d facets through each vertex and d vertices on ...
متن کاملOn the Volume of Unbounded Polyhedra in the Hyperbolic Space
In the Euclidean plane the definition of the area of the polygon harmonizes well with intuition, since by the decomposition theorem of Farkas Bolyai [2] two polygons of the same area can be decomposed into pairwise congruent polygons. The definition of the measure of an unbounded polyhedron in twoand in three-dimensional Euclidean space [7] is likewise well-founded, since we obtain an inner cha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1993
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.18.3.635